Improved Bounds for the Chromatic Number of the Lexicographic Product of Graphs
نویسنده
چکیده
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and generalizes several known results is proved. It is applied in particular to characterize graphs that have a complete core. An improved lower bound is also given.
منابع مشابه
On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملOn the fractional chromatic number, the chromatic number, and graph products
It is shown that the difference between the chromatic number χ and the fractional chromatic number χf can be arbitrarily large in the class of uniquely colorable, vertex transitive graphs. For the lexicographic product G ◦ H it is shown that χ(G ◦ H) ≥ χf (G)χ(H). This bound has several consequences, in particular it unifies and extends several known lower bounds. Lower bounds of Stahl (for gen...
متن کاملOn the chromatic number of the lexicographic product and the Cartesian sum of graphs
Let G[H] be the lexicographic product of graphs G and H and let G⊕H be their Cartesian sum. It is proved that if G is a nonbipartite graph, then for any graph H, χ(G[H]) ≥ 2χ(H)+d k e, where 2k+1 is the length of a shortest odd cycle of G. Chromatic numbers of the Cartesian sum of graphs are also considered. It is shown in particular that for χ–critical and not complete graphs G and H, χ(G ⊕ H)...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملNested colorings of graphs
We develop a new upper bound, called the nested chromatic number, for the chromatic number of a finite simple graph. This new invariant can be computed in polynomial time, unlike the standard chromatic number which is NP -hard. We further develop multiple distinct bounds on the nested chromatic number using common properties of graphs. We also determine the behavior of the nested chromatic numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010